Feature Selection by Markov Chain Monte Carlo Sampling - A Bayesian Approach
نویسنده
چکیده
We redefine the problem of feature selection as one of model selection and propose to use a Markov Chain Monte Carlo method to sample models. The applicability of our method is related to Bayesian network classifiers. Simulation experiments indicate that our novel proposal distribution results in an ignorant proposal prior. Finally, it is shown how the sampling can be controlled by a regularization prior.
منابع مشابه
Bayesian hypothesis testing for the distribution of insurance claim counts using the Gibbs sampler
We construct and present a Markov Chain Monte Carlo (MCMC) algorithm for the estimation of posterior odds and probabilities of alternative models used to evaluate competing hypotheses regarding three common discrete distributions involved in the modeling of the outstanding claim counts in actuarial science. The proposed methodology involves advanced statistical techniques of Bayesian modeling w...
متن کاملPopulation-based reversible jump Markov chain Monte Carlo
We present an extension of population-based Markov chain Monte Carlo to the transdimensional case. A major challenge is that of simulating from highand transdimensional target measures. In such cases, Markov chain Monte Carlo methods may not adequately traverse the support of the target; the simulation results will be unreliable. We develop population methods to deal with such problems, and giv...
متن کاملBayesian Generalized Kernel Models
We propose a fully Bayesian approach for generalized kernel models (GKMs), which are extensions of generalized linear models in the feature space induced by a reproducing kernel. We place a mixture of a point-mass distribution and Silverman’s g-prior on the regression vector of GKMs. This mixture prior allows a fraction of the regression vector to be zero. Thus, it serves for sparse modeling an...
متن کاملOn Input Selection with Reversible Jump Markov Chain Monte Carlo Sampling
In this paper we will treat input selection for a radial basis function (RBF) like classifier within a Bayesian framework. We approximate the a-posteriori distribution over both model coefficients and input subsets by samples drawn with Gibbs updates and reversible jump moves. Using some public datasets, we compare the classification accuracy of the method with a conventional ARD scheme. These ...
متن کاملMarkov chain Monte Carlo with mixtures of singular distributions
Markov chain Monte Carlo (MCMC) methods for Bayesian computation are mostly used when the dominating measure is the Lebesgue measure, the counting measure or a product of these. Many Bayesian problems give rise to distributions that are not dominated by the Lebesgue measure or the counting measure alone. In this paper, we introduce a simple framework for using MCMC algorithms in Bayesian comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004